A parallel computing architecture for high-performance OWL reasoning
نویسندگان
چکیده
منابع مشابه
A Component Architecture for High-Performance Computing∗
The Common Component Architecture (CCA) provides a means for developers to manage the complexity of large-scale scientific software systems and to move toward a “plug and play” environment for high-performance computing. The CCA model allows for a direct connection between components within the same process to maintain performance on inter-component calls. It is neutral with respect to parallel...
متن کاملParallel OWL Reasoning: Merge Classification
Our research is motivated by the ubiquitous availability of multiprocessor computers and the observation that available Web Ontology Language (OWL) reasoners only make use of a single processor. This becomes rather frustrating for users working in ontology development, especially if their ontologies are complex and require long processing times using these OWL reasoners. We present a novel algo...
متن کاملHigh Performance Computing: Grid Computing & Parallel Programming
Science is constantly pushing the limits of computational and storage power and even the fastest supercomputers are not capable of satisfying the computational demand. Recent advances in hardware technologies have provided more computing power than ever before and with the advent of multiple core processors we can expect this trend to continue. It is expected that processors with hundreds of co...
متن کاملHigh performance compilers for parallel computing
Following your need to always fulfil the inspiration to obtain everybody is now simple. Connecting to the internet is one of the short cuts to do. There are so many sources that offer and connect us to other world condition. As one of the products to see in internet, this website becomes a very available place to look for countless high performance compilers for parallel computing sources. Yeah...
متن کاملHigh-Performance Computing on a Honeycomb Architecture
We explore time and space optimization problems involved in the mapping of parallel algorithms onto a honeycomb architecture. When a well-known mapping is used, mapped algorithms generally exhibit execution slowdown and require too large area. We design several optimization techniques and enhance the mapping process. Experimental results show more than 50 % saving in processor resources and 30 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Computing
سال: 2019
ISSN: 0167-8191
DOI: 10.1016/j.parco.2018.05.001